A Resource Leveling Model Based On Genetic Algorithms: Activity Splitting Allowed

نویسندگان

  • Nasser Razavi
  • Nasser Mozayani
چکیده

The goal of resource leveling is to minimize the deviation between the resource requirements and the desired resource profile to prevent problems that caused by fluctuation of required resources. It is a common problem and arises frequently in real situations and therefore has been studied numerous times. Almost in all of these studies and the resulting solutions, there exist a common element, which is once an activity is started, it cannot be stopped and restarted again. That is, it cannot be split. In many instances in actual construction, there exist activities that can be split. So, it seems to be very useful to develop a model for resource leveling problems that allows certain activities to be split. An important interesting property that such a model should have is its simplicity. By simplicity we mean its ease of use by inexpert users without strong mathematical background. This paper presents a model based on genetic algorithms to level resources that permits selected activities to stop and restart. This splitting of activities results in improvement to the leveling solution that is traditionally achieved when splitting is not allowed. Examples are presented that illustrate the improvement in the solution obtained from the proposed model compared to models that do not allow splitting and compares the result to that obtained using commercially available software. The model presented here is very efficient and effective. Therefore, it can be used in real situations to automatically solve resource leveling problems efficiently to obtain effective results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource leveling scheduling by an ant colony-based model

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

متن کامل

Earthwork Volume Optimization Using Imperialistic Competitive Algorithm to Minimize Energy Consumption of Agricultural Land Leveling

Land leveling is one of the most important steps in soil preparation for consequent objectives.  Parallel policies need to take both energy and environmental subjects into the account as well as certain financial development and eco-friendly protection. Energy is one of the most important elements in agricultural sector. Nevertheless, pollution is linked with the usage of fossil fuels (particul...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007